On-line Network Optimization Problems
نویسندگان
چکیده
We survey results on online versions of the standard network optimization problems, including the minimum spanning tree problem, the minimum Steiner tree problem, the weighted and unweighted matching problems, and the traveling salesman problem. The goal in these problems is to maintain, with minimal changes, a low cost subgraph of some type in a dynamically changing network.
منابع مشابه
An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملAn Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملApplication of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملOnline Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملOptimization of the Implementation of Tara Program Based on Identification, Analysis and Prioritization of Effective Factors through A Fuzzy Network Analysis (FANP) Technique
Abstract Being constantly reviewed and reformed, the strategy of dynamic and systematic strengthening of tax structures of countries has undeniable impacts on the economic development of countries. The Tax Administration and Revenue Automation (TARA) Program has been designed with such a goal and in line with the macro- policies of the Iranian government, but it has not been able to move forwa...
متن کاملA Multi-objective Mixed Model Two-sided Assembly Line Sequencing Problem in a Make –To- Order Environment with Customer Order Prioritization
Mixed model two-sided assembly lines (MM2SAL) are applied to assemble large product models, which is produced in high-volume. So, the sequence planning of products to reduce cost and increase productivity in this kind of lines is imperative. The presented problem is tackled in two steps. In step 1, a framework is developed to select and prioritize customer orders under the finite capacity of th...
متن کامل